Left Termination proof of /tmp/tmpVl0lvE/quicksort-fb.pl

Left Termination of the query pattern qs_in_2(a, g) w.r.t. the given Prolog program could not be shown:

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

Clauses:

qs([], []).
qs(.(X, Xs), Ys) :- ','(part(X, Xs, Littles, Bigs), ','(qs(Littles, Ls), ','(qs(Bigs, Bs), app(Ls, .(X, Bs), Ys)))).
part(X, .(Y, Xs), .(Y, Ls), Bs) :- ','(less(X, Y), part(X, Xs, Ls, Bs)).
part(X, .(Y, Xs), Ls, .(Y, Bs)) :- part(X, Xs, Ls, Bs).
part(X, [], [], []).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).
less(0, s(X)).
less(s(X), s(Y)) :- less(X, Y).

Queries:

qs(a,g).

We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
qs_in: (f,b) (b,f)
part_in: (f,f,f,f) (b,f,f,f) (f,b,f,f) (b,b,f,f)
less_in: (f,f) (b,f)
app_in: (b,b,f) (b,b,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

  ↳ PrologToPiTRSProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

QS_IN_AG(.(X, Xs), Ys) → U1_AG(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
QS_IN_AG(.(X, Xs), Ys) → PART_IN_AAAA(X, Xs, Littles, Bigs)
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AAAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
LESS_IN_AA(s(X), s(Y)) → U9_AA(X, Y, less_in_aa(X, Y))
LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
LESS_IN_GA(s(X), s(Y)) → U9_GA(X, Y, less_in_aa(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AAAA(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_AG(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
QS_IN_GA(.(X, Xs), Ys) → PART_IN_AGAA(X, Xs, Littles, Bigs)
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AGAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AGAA(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_GA(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_GA(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGA(Ls, .(X, Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U8_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_AG(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_AG(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGG(Ls, .(X, Bs), Ys)
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → U8_GGG(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

The argument filtering Pi contains the following mapping:
qs_in_ag(x1, x2) = qs_in_ag(x2)
[] = []
qs_out_ag(x1, x2) = qs_out_ag(x1)
U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4)
part_in_aaaa(x1, x2, x3, x4) = part_in_aaaa
U5_aaaa(x1, x2, x3, x4, x5, x6) = U5_aaaa(x6)
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
U6_aaaa(x1, x2, x3, x4, x5, x6) = U6_aaaa(x6)
part_in_gaaa(x1, x2, x3, x4) = part_in_gaaa(x1)
U5_gaaa(x1, x2, x3, x4, x5, x6) = U5_gaaa(x1, x6)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
U6_gaaa(x1, x2, x3, x4, x5, x6) = U6_gaaa(x6)
U7_gaaa(x1, x2, x3, x4, x5, x6) = U7_gaaa(x6)
part_out_gaaa(x1, x2, x3, x4) = part_out_gaaa(x2, x3, x4)
.(x1, x2) = .(x2)
part_out_aaaa(x1, x2, x3, x4) = part_out_aaaa(x2, x3, x4)
U7_aaaa(x1, x2, x3, x4, x5, x6) = U7_aaaa(x6)
U2_ag(x1, x2, x3, x4, x5) = U2_ag(x2, x3, x4, x5)
qs_in_ga(x1, x2) = qs_in_ga(x1)
qs_out_ga(x1, x2) = qs_out_ga(x2)
U1_ga(x1, x2, x3, x4) = U1_ga(x4)
part_in_agaa(x1, x2, x3, x4) = part_in_agaa(x2)
U5_agaa(x1, x2, x3, x4, x5, x6) = U5_agaa(x3, x6)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x6)
part_in_ggaa(x1, x2, x3, x4) = part_in_ggaa(x1, x2)
U5_ggaa(x1, x2, x3, x4, x5, x6) = U5_ggaa(x1, x3, x6)
U6_ggaa(x1, x2, x3, x4, x5, x6) = U6_ggaa(x6)
U7_ggaa(x1, x2, x3, x4, x5, x6) = U7_ggaa(x6)
part_out_ggaa(x1, x2, x3, x4) = part_out_ggaa(x3, x4)
part_out_agaa(x1, x2, x3, x4) = part_out_agaa(x3, x4)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x6)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x4, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x4, x5)
U4_ga(x1, x2, x3, x4) = U4_ga(x4)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
app_out_gga(x1, x2, x3) = app_out_gga(x3)
U8_gga(x1, x2, x3, x4, x5) = U8_gga(x5)
U3_ag(x1, x2, x3, x4, x5) = U3_ag(x2, x3, x4, x5)
U4_ag(x1, x2, x3, x4) = U4_ag(x2, x4)
app_in_ggg(x1, x2, x3) = app_in_ggg(x1, x2, x3)
app_out_ggg(x1, x2, x3) = app_out_ggg
U8_ggg(x1, x2, x3, x4, x5) = U8_ggg(x5)
U5_GAAA(x1, x2, x3, x4, x5, x6) = U5_GAAA(x1, x6)
U5_AAAA(x1, x2, x3, x4, x5, x6) = U5_AAAA(x6)
LESS_IN_AA(x1, x2) = LESS_IN_AA
U6_GGAA(x1, x2, x3, x4, x5, x6) = U6_GGAA(x6)
U6_AAAA(x1, x2, x3, x4, x5, x6) = U6_AAAA(x6)
U7_GGAA(x1, x2, x3, x4, x5, x6) = U7_GGAA(x6)
U1_GA(x1, x2, x3, x4) = U1_GA(x4)
U5_AGAA(x1, x2, x3, x4, x5, x6) = U5_AGAA(x3, x6)
LESS_IN_GA(x1, x2) = LESS_IN_GA(x1)
PART_IN_AGAA(x1, x2, x3, x4) = PART_IN_AGAA(x2)
APP_IN_GGG(x1, x2, x3) = APP_IN_GGG(x1, x2, x3)
U6_AGAA(x1, x2, x3, x4, x5, x6) = U6_AGAA(x6)
U3_AG(x1, x2, x3, x4, x5) = U3_AG(x2, x3, x4, x5)
U7_AGAA(x1, x2, x3, x4, x5, x6) = U7_AGAA(x6)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x4, x5)
U4_GA(x1, x2, x3, x4) = U4_GA(x4)
U3_GA(x1, x2, x3, x4, x5) = U3_GA(x4, x5)
PART_IN_GAAA(x1, x2, x3, x4) = PART_IN_GAAA(x1)
U9_GA(x1, x2, x3) = U9_GA(x3)
U7_AAAA(x1, x2, x3, x4, x5, x6) = U7_AAAA(x6)
APP_IN_GGA(x1, x2, x3) = APP_IN_GGA(x1, x2)
QS_IN_AG(x1, x2) = QS_IN_AG(x2)
QS_IN_GA(x1, x2) = QS_IN_GA(x1)
PART_IN_GGAA(x1, x2, x3, x4) = PART_IN_GGAA(x1, x2)
U5_GGAA(x1, x2, x3, x4, x5, x6) = U5_GGAA(x1, x3, x6)
PART_IN_AAAA(x1, x2, x3, x4) = PART_IN_AAAA
U2_AG(x1, x2, x3, x4, x5) = U2_AG(x2, x3, x4, x5)
U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4)
U8_GGG(x1, x2, x3, x4, x5) = U8_GGG(x5)
U8_GGA(x1, x2, x3, x4, x5) = U8_GGA(x5)
U6_GAAA(x1, x2, x3, x4, x5, x6) = U6_GAAA(x6)
U4_AG(x1, x2, x3, x4) = U4_AG(x2, x4)
U9_AA(x1, x2, x3) = U9_AA(x3)
U7_GAAA(x1, x2, x3, x4, x5, x6) = U7_GAAA(x6)

We have to consider all (P,R,Pi)-chains

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

QS_IN_AG(.(X, Xs), Ys) → U1_AG(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
QS_IN_AG(.(X, Xs), Ys) → PART_IN_AAAA(X, Xs, Littles, Bigs)
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AAAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
LESS_IN_AA(s(X), s(Y)) → U9_AA(X, Y, less_in_aa(X, Y))
LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
LESS_IN_GA(s(X), s(Y)) → U9_GA(X, Y, less_in_aa(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AAAA(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_AG(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
QS_IN_GA(.(X, Xs), Ys) → PART_IN_AGAA(X, Xs, Littles, Bigs)
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AGAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AGAA(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_GA(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_GA(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGA(Ls, .(X, Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U8_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_AG(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_AG(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGG(Ls, .(X, Bs), Ys)
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → U8_GGG(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x2)
APP_IN_GGG(x1, x2, x3) = APP_IN_GGG(x1, x2, x3)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(Xs), Ys, .(Zs)) → APP_IN_GGG(Xs, Ys, Zs)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

APP_IN_GGG(.(Xs), Ys, .(Zs)) → APP_IN_GGG(Xs, Ys, Zs)
The graph contains the following edges 1 > 1, 2 >= 2, 3 > 3

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x2)
APP_IN_GGA(x1, x2, x3) = APP_IN_GGA(x1, x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(Xs), Ys) → APP_IN_GGA(Xs, Ys)

From the DPs we obtained the following set of size-change graphs:

APP_IN_GGA(.(Xs), Ys) → APP_IN_GGA(Xs, Ys)
The graph contains the following edges 1 > 1, 2 >= 2

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)

R is empty.
The argument filtering Pi contains the following mapping:
s(x1) = s
LESS_IN_AA(x1, x2) = LESS_IN_AA

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ NonTerminationProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

LESS_IN_AA → LESS_IN_AA

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

LESS_IN_AA → LESS_IN_AA

The TRS R consists of the following rules:none

s = LESS_IN_AA evaluates to t =LESS_IN_AA

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from LESS_IN_AA to LESS_IN_AA.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
PART_IN_GGAA(x1, x2, x3, x4) = PART_IN_GGAA(x1, x2)
U5_GGAA(x1, x2, x3, x4, x5, x6) = U5_GGAA(x1, x3, x6)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GGAA(X, .(Xs)) → U5_GGAA(X, Xs, less_in_ga(X))
U5_GGAA(X, Xs, less_out_ga(Y)) → PART_IN_GGAA(X, Xs)
PART_IN_GGAA(X, .(Xs)) → PART_IN_GGAA(X, Xs)

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

PART_IN_GGAA(X, .(Xs)) → U5_GGAA(X, Xs, less_in_ga(X))
The graph contains the following edges 1 >= 1, 2 > 2
PART_IN_GGAA(X, .(Xs)) → PART_IN_GGAA(X, Xs)
The graph contains the following edges 1 >= 1, 2 > 2
U5_GGAA(X, Xs, less_out_ga(Y)) → PART_IN_GGAA(X, Xs)
The graph contains the following edges 1 >= 1, 2 >= 2

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x2)
PART_IN_AGAA(x1, x2, x3, x4) = PART_IN_AGAA(x2)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(.(Xs)) → PART_IN_AGAA(Xs)

From the DPs we obtained the following set of size-change graphs:

PART_IN_AGAA(.(Xs)) → PART_IN_AGAA(Xs)
The graph contains the following edges 1 > 1

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)

The TRS R consists of the following rules:

part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))

The argument filtering Pi contains the following mapping:
[] = []
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
qs_in_ga(x1, x2) = qs_in_ga(x1)
qs_out_ga(x1, x2) = qs_out_ga(x2)
U1_ga(x1, x2, x3, x4) = U1_ga(x4)
part_in_agaa(x1, x2, x3, x4) = part_in_agaa(x2)
U5_agaa(x1, x2, x3, x4, x5, x6) = U5_agaa(x3, x6)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x6)
part_in_ggaa(x1, x2, x3, x4) = part_in_ggaa(x1, x2)
U5_ggaa(x1, x2, x3, x4, x5, x6) = U5_ggaa(x1, x3, x6)
U6_ggaa(x1, x2, x3, x4, x5, x6) = U6_ggaa(x6)
U7_ggaa(x1, x2, x3, x4, x5, x6) = U7_ggaa(x6)
part_out_ggaa(x1, x2, x3, x4) = part_out_ggaa(x3, x4)
part_out_agaa(x1, x2, x3, x4) = part_out_agaa(x3, x4)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x6)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x4, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x4, x5)
U4_ga(x1, x2, x3, x4) = U4_ga(x4)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
app_out_gga(x1, x2, x3) = app_out_gga(x3)
U8_gga(x1, x2, x3, x4, x5) = U8_gga(x5)
U1_GA(x1, x2, x3, x4) = U1_GA(x4)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x4, x5)
QS_IN_GA(x1, x2) = QS_IN_GA(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

QS_IN_GA(.(Xs)) → U1_GA(part_in_agaa(Xs))
U1_GA(part_out_agaa(Littles, Bigs)) → QS_IN_GA(Littles)
U2_GA(Bigs, qs_out_ga(Ls)) → QS_IN_GA(Bigs)
U1_GA(part_out_agaa(Littles, Bigs)) → U2_GA(Bigs, qs_in_ga(Littles))

The TRS R consists of the following rules:

part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
part_in_agaa(.(Xs)) → U7_agaa(part_in_agaa(Xs))
part_in_agaa([]) → part_out_agaa([], [])
qs_in_ga([]) → qs_out_ga([])
qs_in_ga(.(Xs)) → U1_ga(part_in_agaa(Xs))
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(part_in_ggaa(X, Xs))
U7_agaa(part_out_agaa(Ls, Bs)) → part_out_agaa(Ls, .(Bs))
U1_ga(part_out_agaa(Littles, Bigs)) → U2_ga(Bigs, qs_in_ga(Littles))
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U6_agaa(part_out_ggaa(Ls, Bs)) → part_out_agaa(.(Ls), Bs)
U2_ga(Bigs, qs_out_ga(Ls)) → U3_ga(Ls, qs_in_ga(Bigs))
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
part_in_ggaa(X, .(Xs)) → U7_ggaa(part_in_ggaa(X, Xs))
part_in_ggaa(X, []) → part_out_ggaa([], [])
U3_ga(Ls, qs_out_ga(Bs)) → U4_ga(app_in_gga(Ls, .(Bs)))
U5_ggaa(X, Xs, less_out_ga(Y)) → U6_ggaa(part_in_ggaa(X, Xs))
U7_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(Ls, .(Bs))
U4_ga(app_out_gga(Ys)) → qs_out_ga(Ys)
less_in_ga(0) → less_out_ga(s)
less_in_ga(s) → U9_ga(less_in_aa)
U6_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(.(Ls), Bs)
app_in_gga([], X) → app_out_gga(X)
app_in_gga(.(Xs), Ys) → U8_gga(app_in_gga(Xs, Ys))
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U8_gga(app_out_gga(Zs)) → app_out_gga(.(Zs))

The set Q consists of the following terms:

part_in_agaa(x0)
qs_in_ga(x0)
U5_agaa(x0, x1)
U7_agaa(x0)
U1_ga(x0)
less_in_aa
U6_agaa(x0)
U2_ga(x0, x1)
U9_aa(x0)
part_in_ggaa(x0, x1)
U3_ga(x0, x1)
U5_ggaa(x0, x1, x2)
U7_ggaa(x0)
U4_ga(x0)
less_in_ga(x0)
U6_ggaa(x0)
app_in_gga(x0, x1)
U9_ga(x0)
U8_gga(x0)

We have to consider all (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

QS_IN_GA(.(Xs)) → U1_GA(part_in_agaa(Xs))

The remaining pairs can at least be oriented weakly.

U1_GA(part_out_agaa(Littles, Bigs)) → QS_IN_GA(Littles)
U2_GA(Bigs, qs_out_ga(Ls)) → QS_IN_GA(Bigs)
U1_GA(part_out_agaa(Littles, Bigs)) → U2_GA(Bigs, qs_in_ga(Littles))

Used ordering: Polynomial interpretation [25]:

POL(.(x₁)) = 1 + x₁
POL(0) = 0
POL(QS_IN_GA(x₁)) = 1 + x₁
POL(U1_GA(x₁)) = 1 + x₁
POL(U1_ga(x₁)) = 1
POL(U2_GA(x₁, x₂)) = x₁ + x₂
POL(U2_ga(x₁, x₂)) = 1
POL(U3_ga(x₁, x₂)) = 1
POL(U4_ga(x₁)) = 1
POL(U5_agaa(x₁, x₂)) = 1 + x₁
POL(U5_ggaa(x₁, x₂, x₃)) = 1 + x₂
POL(U6_agaa(x₁)) = 1 + x₁
POL(U6_ggaa(x₁)) = 1 + x₁
POL(U7_agaa(x₁)) = 1 + x₁
POL(U7_ggaa(x₁)) = 1 + x₁
POL(U8_gga(x₁)) = 0
POL(U9_aa(x₁)) = 0
POL(U9_ga(x₁)) = 0
POL([]) = 0
POL(app_in_gga(x₁, x₂)) = 0
POL(app_out_gga(x₁)) = 0
POL(less_in_aa) = 0
POL(less_in_ga(x₁)) = 0
POL(less_out_aa(x₁, x₂)) = 0
POL(less_out_ga(x₁)) = 0
POL(part_in_agaa(x₁)) = x₁
POL(part_in_ggaa(x₁, x₂)) = x₂
POL(part_out_agaa(x₁, x₂)) = x₁ + x₂
POL(part_out_ggaa(x₁, x₂)) = x₁ + x₂
POL(qs_in_ga(x₁)) = 1 + x₁
POL(qs_out_ga(x₁)) = 1
POL(s) = 0

The following usable rules [17] were oriented:

U3_ga(Ls, qs_out_ga(Bs)) → U4_ga(app_in_gga(Ls, .(Bs)))
part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
U5_ggaa(X, Xs, less_out_ga(Y)) → U6_ggaa(part_in_ggaa(X, Xs))
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(part_in_ggaa(X, Xs))
U7_agaa(part_out_agaa(Ls, Bs)) → part_out_agaa(Ls, .(Bs))
part_in_ggaa(X, .(Xs)) → U7_ggaa(part_in_ggaa(X, Xs))
U4_ga(app_out_gga(Ys)) → qs_out_ga(Ys)
U1_ga(part_out_agaa(Littles, Bigs)) → U2_ga(Bigs, qs_in_ga(Littles))
U2_ga(Bigs, qs_out_ga(Ls)) → U3_ga(Ls, qs_in_ga(Bigs))
U6_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(.(Ls), Bs)
qs_in_ga(.(Xs)) → U1_ga(part_in_agaa(Xs))
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
U7_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(Ls, .(Bs))
U6_agaa(part_out_ggaa(Ls, Bs)) → part_out_agaa(.(Ls), Bs)
part_in_agaa([]) → part_out_agaa([], [])
part_in_ggaa(X, []) → part_out_ggaa([], [])
part_in_agaa(.(Xs)) → U7_agaa(part_in_agaa(Xs))
qs_in_ga([]) → qs_out_ga([])

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

              ↳ PiDP

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

U1_GA(part_out_agaa(Littles, Bigs)) → QS_IN_GA(Littles)
U2_GA(Bigs, qs_out_ga(Ls)) → QS_IN_GA(Bigs)
U1_GA(part_out_agaa(Littles, Bigs)) → U2_GA(Bigs, qs_in_ga(Littles))

The TRS R consists of the following rules:

part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
part_in_agaa(.(Xs)) → U7_agaa(part_in_agaa(Xs))
part_in_agaa([]) → part_out_agaa([], [])
qs_in_ga([]) → qs_out_ga([])
qs_in_ga(.(Xs)) → U1_ga(part_in_agaa(Xs))
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(part_in_ggaa(X, Xs))
U7_agaa(part_out_agaa(Ls, Bs)) → part_out_agaa(Ls, .(Bs))
U1_ga(part_out_agaa(Littles, Bigs)) → U2_ga(Bigs, qs_in_ga(Littles))
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U6_agaa(part_out_ggaa(Ls, Bs)) → part_out_agaa(.(Ls), Bs)
U2_ga(Bigs, qs_out_ga(Ls)) → U3_ga(Ls, qs_in_ga(Bigs))
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
part_in_ggaa(X, .(Xs)) → U7_ggaa(part_in_ggaa(X, Xs))
part_in_ggaa(X, []) → part_out_ggaa([], [])
U3_ga(Ls, qs_out_ga(Bs)) → U4_ga(app_in_gga(Ls, .(Bs)))
U5_ggaa(X, Xs, less_out_ga(Y)) → U6_ggaa(part_in_ggaa(X, Xs))
U7_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(Ls, .(Bs))
U4_ga(app_out_gga(Ys)) → qs_out_ga(Ys)
less_in_ga(0) → less_out_ga(s)
less_in_ga(s) → U9_ga(less_in_aa)
U6_ggaa(part_out_ggaa(Ls, Bs)) → part_out_ggaa(.(Ls), Bs)
app_in_gga([], X) → app_out_gga(X)
app_in_gga(.(Xs), Ys) → U8_gga(app_in_gga(Xs, Ys))
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U8_gga(app_out_gga(Zs)) → app_out_gga(.(Zs))

The set Q consists of the following terms:

part_in_agaa(x0)
qs_in_ga(x0)
U5_agaa(x0, x1)
U7_agaa(x0)
U1_ga(x0)
less_in_aa
U6_agaa(x0)
U2_ga(x0, x1)
U9_aa(x0)
part_in_ggaa(x0, x1)
U3_ga(x0, x1)
U5_ggaa(x0, x1, x2)
U7_ggaa(x0)
U4_ga(x0)
less_in_ga(x0)
U6_ggaa(x0)
app_in_gga(x0, x1)
U9_ga(x0)
U8_gga(x0)

We have to consider all (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 3 less nodes.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
U5_GAAA(x1, x2, x3, x4, x5, x6) = U5_GAAA(x1, x6)
PART_IN_GAAA(x1, x2, x3, x4) = PART_IN_GAAA(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(Y)) → PART_IN_GAAA(X)
PART_IN_GAAA(X) → U5_GAAA(X, less_in_ga(X))

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By narrowing [15] the rule PART_IN_GAAA(X) → U5_GAAA(X, less_in_ga(X)) at position [1] we obtained the following new rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(Y)) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(Y)) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

less_in_ga(x0)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Instantiation

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(Y)) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By instantiating [15] the rule U5_GAAA(X, less_out_ga(Y)) → PART_IN_GAAA(X) we obtained the following new rules:

U5_GAAA(s, less_out_ga(x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(s)) → PART_IN_GAAA(0)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Instantiation

                                      ↳ QDP

                                        ↳ NonTerminationProof

              ↳ PiDP

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
U5_GAAA(s, less_out_ga(x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(s)) → PART_IN_GAAA(0)
PART_IN_GAAA(X) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
U5_GAAA(s, less_out_ga(x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(s)) → PART_IN_GAAA(0)
PART_IN_GAAA(X) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(s))

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

s = PART_IN_GAAA(X) evaluates to t =PART_IN_GAAA(X)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from PART_IN_GAAA(X) to PART_IN_GAAA(X).

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

  ↳ PrologToPiTRSProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)

R is empty.
The argument filtering Pi contains the following mapping:
.(x1, x2) = .(x2)
PART_IN_AAAA(x1, x2, x3, x4) = PART_IN_AAAA

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ NonTerminationProof

  ↳ PrologToPiTRSProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA → PART_IN_AAAA

The TRS R consists of the following rules:none

s = PART_IN_AAAA evaluates to t =PART_IN_AAAA

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from PART_IN_AAAA to PART_IN_AAAA.

We use the technique of [30]. With regard to the inferred argument filtering the predicates were used in the following modes:
qs_in: (f,b) (b,f)
part_in: (f,f,f,f) (b,f,f,f) (f,b,f,f) (b,b,f,f)
less_in: (f,f) (b,f)
app_in: (b,b,f) (b,b,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

QS_IN_AG(.(X, Xs), Ys) → U1_AG(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
QS_IN_AG(.(X, Xs), Ys) → PART_IN_AAAA(X, Xs, Littles, Bigs)
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AAAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
LESS_IN_AA(s(X), s(Y)) → U9_AA(X, Y, less_in_aa(X, Y))
LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
LESS_IN_GA(s(X), s(Y)) → U9_GA(X, Y, less_in_aa(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AAAA(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_AG(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
QS_IN_GA(.(X, Xs), Ys) → PART_IN_AGAA(X, Xs, Littles, Bigs)
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AGAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AGAA(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_GA(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_GA(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGA(Ls, .(X, Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U8_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_AG(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_AG(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGG(Ls, .(X, Bs), Ys)
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → U8_GGG(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

The argument filtering Pi contains the following mapping:
qs_in_ag(x1, x2) = qs_in_ag(x2)
[] = []
qs_out_ag(x1, x2) = qs_out_ag(x1, x2)
U1_ag(x1, x2, x3, x4) = U1_ag(x3, x4)
part_in_aaaa(x1, x2, x3, x4) = part_in_aaaa
U5_aaaa(x1, x2, x3, x4, x5, x6) = U5_aaaa(x6)
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
U6_aaaa(x1, x2, x3, x4, x5, x6) = U6_aaaa(x6)
part_in_gaaa(x1, x2, x3, x4) = part_in_gaaa(x1)
U5_gaaa(x1, x2, x3, x4, x5, x6) = U5_gaaa(x1, x6)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x1, x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
U6_gaaa(x1, x2, x3, x4, x5, x6) = U6_gaaa(x1, x6)
U7_gaaa(x1, x2, x3, x4, x5, x6) = U7_gaaa(x1, x6)
part_out_gaaa(x1, x2, x3, x4) = part_out_gaaa(x1, x2, x3, x4)
.(x1, x2) = .(x2)
part_out_aaaa(x1, x2, x3, x4) = part_out_aaaa(x2, x3, x4)
U7_aaaa(x1, x2, x3, x4, x5, x6) = U7_aaaa(x6)
U2_ag(x1, x2, x3, x4, x5) = U2_ag(x2, x3, x4, x5)
qs_in_ga(x1, x2) = qs_in_ga(x1)
qs_out_ga(x1, x2) = qs_out_ga(x1, x2)
U1_ga(x1, x2, x3, x4) = U1_ga(x2, x4)
part_in_agaa(x1, x2, x3, x4) = part_in_agaa(x2)
U5_agaa(x1, x2, x3, x4, x5, x6) = U5_agaa(x3, x6)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x3, x6)
part_in_ggaa(x1, x2, x3, x4) = part_in_ggaa(x1, x2)
U5_ggaa(x1, x2, x3, x4, x5, x6) = U5_ggaa(x1, x3, x6)
U6_ggaa(x1, x2, x3, x4, x5, x6) = U6_ggaa(x1, x3, x6)
U7_ggaa(x1, x2, x3, x4, x5, x6) = U7_ggaa(x1, x3, x6)
part_out_ggaa(x1, x2, x3, x4) = part_out_ggaa(x1, x2, x3, x4)
part_out_agaa(x1, x2, x3, x4) = part_out_agaa(x2, x3, x4)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x3, x6)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x2, x4, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x2, x4, x5)
U4_ga(x1, x2, x3, x4) = U4_ga(x2, x4)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
app_out_gga(x1, x2, x3) = app_out_gga(x1, x2, x3)
U8_gga(x1, x2, x3, x4, x5) = U8_gga(x2, x3, x5)
U3_ag(x1, x2, x3, x4, x5) = U3_ag(x2, x3, x4, x5)
U4_ag(x1, x2, x3, x4) = U4_ag(x2, x3, x4)
app_in_ggg(x1, x2, x3) = app_in_ggg(x1, x2, x3)
app_out_ggg(x1, x2, x3) = app_out_ggg(x1, x2, x3)
U8_ggg(x1, x2, x3, x4, x5) = U8_ggg(x2, x3, x4, x5)
U5_GAAA(x1, x2, x3, x4, x5, x6) = U5_GAAA(x1, x6)
U5_AAAA(x1, x2, x3, x4, x5, x6) = U5_AAAA(x6)
LESS_IN_AA(x1, x2) = LESS_IN_AA
U6_GGAA(x1, x2, x3, x4, x5, x6) = U6_GGAA(x1, x3, x6)
U6_AAAA(x1, x2, x3, x4, x5, x6) = U6_AAAA(x6)
U7_GGAA(x1, x2, x3, x4, x5, x6) = U7_GGAA(x1, x3, x6)
U1_GA(x1, x2, x3, x4) = U1_GA(x2, x4)
U5_AGAA(x1, x2, x3, x4, x5, x6) = U5_AGAA(x3, x6)
LESS_IN_GA(x1, x2) = LESS_IN_GA(x1)
PART_IN_AGAA(x1, x2, x3, x4) = PART_IN_AGAA(x2)
APP_IN_GGG(x1, x2, x3) = APP_IN_GGG(x1, x2, x3)
U6_AGAA(x1, x2, x3, x4, x5, x6) = U6_AGAA(x3, x6)
U3_AG(x1, x2, x3, x4, x5) = U3_AG(x2, x3, x4, x5)
U7_AGAA(x1, x2, x3, x4, x5, x6) = U7_AGAA(x3, x6)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x2, x4, x5)
U4_GA(x1, x2, x3, x4) = U4_GA(x2, x4)
U3_GA(x1, x2, x3, x4, x5) = U3_GA(x2, x4, x5)
PART_IN_GAAA(x1, x2, x3, x4) = PART_IN_GAAA(x1)
U9_GA(x1, x2, x3) = U9_GA(x3)
U7_AAAA(x1, x2, x3, x4, x5, x6) = U7_AAAA(x6)
APP_IN_GGA(x1, x2, x3) = APP_IN_GGA(x1, x2)
QS_IN_AG(x1, x2) = QS_IN_AG(x2)
QS_IN_GA(x1, x2) = QS_IN_GA(x1)
PART_IN_GGAA(x1, x2, x3, x4) = PART_IN_GGAA(x1, x2)
U5_GGAA(x1, x2, x3, x4, x5, x6) = U5_GGAA(x1, x3, x6)
PART_IN_AAAA(x1, x2, x3, x4) = PART_IN_AAAA
U2_AG(x1, x2, x3, x4, x5) = U2_AG(x2, x3, x4, x5)
U1_AG(x1, x2, x3, x4) = U1_AG(x3, x4)
U8_GGG(x1, x2, x3, x4, x5) = U8_GGG(x2, x3, x4, x5)
U8_GGA(x1, x2, x3, x4, x5) = U8_GGA(x2, x3, x5)
U6_GAAA(x1, x2, x3, x4, x5, x6) = U6_GAAA(x1, x6)
U4_AG(x1, x2, x3, x4) = U4_AG(x2, x3, x4)
U9_AA(x1, x2, x3) = U9_AA(x3)
U7_GAAA(x1, x2, x3, x4, x5, x6) = U7_GAAA(x1, x6)

We have to consider all (P,R,Pi)-chains

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

Pi DP problem:
The TRS P consists of the following rules:

QS_IN_AG(.(X, Xs), Ys) → U1_AG(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
QS_IN_AG(.(X, Xs), Ys) → PART_IN_AAAA(X, Xs, Littles, Bigs)
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AAAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
LESS_IN_AA(s(X), s(Y)) → U9_AA(X, Y, less_in_aa(X, Y))
LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_AAAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
LESS_IN_GA(s(X), s(Y)) → U9_GA(X, Y, less_in_aa(X, Y))
LESS_IN_GA(s(X), s(Y)) → LESS_IN_AA(X, Y)
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GAAA(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AAAA(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_AG(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_AG(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
QS_IN_GA(.(X, Xs), Ys) → PART_IN_AGAA(X, Xs, Littles, Bigs)
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_AGAA(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
PART_IN_AGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_AA(X, Y)
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_AGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_AGAA(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → LESS_IN_GA(X, Y)
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_GGAA(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_AGAA(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_GA(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_GA(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U3_GA(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGA(Ls, .(X, Bs), Ys)
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → U8_GGA(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_AG(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U2_AG(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_AG(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
U3_AG(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → APP_IN_GGG(Ls, .(X, Bs), Ys)
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → U8_GGG(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGG(Xs, Ys, Zs)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

APP_IN_GGG(.(Xs), Ys, .(Zs)) → APP_IN_GGG(Xs, Ys, Zs)

From the DPs we obtained the following set of size-change graphs:

APP_IN_GGG(.(Xs), Ys, .(Zs)) → APP_IN_GGG(Xs, Ys, Zs)
The graph contains the following edges 1 > 1, 2 >= 2, 3 > 3

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(X, Xs), Ys, .(X, Zs)) → APP_IN_GGA(Xs, Ys, Zs)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

APP_IN_GGA(.(Xs), Ys) → APP_IN_GGA(Xs, Ys)

From the DPs we obtained the following set of size-change graphs:

APP_IN_GGA(.(Xs), Ys) → APP_IN_GGA(Xs, Ys)
The graph contains the following edges 1 > 1, 2 >= 2

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

LESS_IN_AA(s(X), s(Y)) → LESS_IN_AA(X, Y)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ NonTerminationProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

LESS_IN_AA → LESS_IN_AA

The TRS R consists of the following rules:none

s = LESS_IN_AA evaluates to t =LESS_IN_AA

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from LESS_IN_AA to LESS_IN_AA.

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U5_GGAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs, Ls, Bs)
PART_IN_GGAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GGAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
PART_IN_GGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x1, x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
PART_IN_GGAA(x1, x2, x3, x4) = PART_IN_GGAA(x1, x2)
U5_GGAA(x1, x2, x3, x4, x5, x6) = U5_GGAA(x1, x3, x6)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GGAA(X, .(Xs)) → U5_GGAA(X, Xs, less_in_ga(X))
U5_GGAA(X, Xs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs)
PART_IN_GGAA(X, .(Xs)) → PART_IN_GGAA(X, Xs)

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(0, s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

PART_IN_GGAA(X, .(Xs)) → U5_GGAA(X, Xs, less_in_ga(X))
The graph contains the following edges 1 >= 1, 2 > 2
PART_IN_GGAA(X, .(Xs)) → PART_IN_GGAA(X, Xs)
The graph contains the following edges 1 >= 1, 2 > 2
U5_GGAA(X, Xs, less_out_ga(X, Y)) → PART_IN_GGAA(X, Xs)
The graph contains the following edges 1 >= 1, 3 > 1, 2 >= 2

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AGAA(X, Xs, Ls, Bs)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_AGAA(.(Xs)) → PART_IN_AGAA(Xs)

From the DPs we obtained the following set of size-change graphs:

PART_IN_AGAA(.(Xs)) → PART_IN_AGAA(Xs)
The graph contains the following edges 1 > 1

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → QS_IN_GA(Littles, Ls)
QS_IN_GA(.(X, Xs), Ys) → U1_GA(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U1_GA(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_GA(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_GA(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs, Bs)

The TRS R consists of the following rules:

part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))

The argument filtering Pi contains the following mapping:
[] = []
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x1, x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
qs_in_ga(x1, x2) = qs_in_ga(x1)
qs_out_ga(x1, x2) = qs_out_ga(x1, x2)
U1_ga(x1, x2, x3, x4) = U1_ga(x2, x4)
part_in_agaa(x1, x2, x3, x4) = part_in_agaa(x2)
U5_agaa(x1, x2, x3, x4, x5, x6) = U5_agaa(x3, x6)
U6_agaa(x1, x2, x3, x4, x5, x6) = U6_agaa(x3, x6)
part_in_ggaa(x1, x2, x3, x4) = part_in_ggaa(x1, x2)
U5_ggaa(x1, x2, x3, x4, x5, x6) = U5_ggaa(x1, x3, x6)
U6_ggaa(x1, x2, x3, x4, x5, x6) = U6_ggaa(x1, x3, x6)
U7_ggaa(x1, x2, x3, x4, x5, x6) = U7_ggaa(x1, x3, x6)
part_out_ggaa(x1, x2, x3, x4) = part_out_ggaa(x1, x2, x3, x4)
part_out_agaa(x1, x2, x3, x4) = part_out_agaa(x2, x3, x4)
U7_agaa(x1, x2, x3, x4, x5, x6) = U7_agaa(x3, x6)
U2_ga(x1, x2, x3, x4, x5) = U2_ga(x2, x4, x5)
U3_ga(x1, x2, x3, x4, x5) = U3_ga(x2, x4, x5)
U4_ga(x1, x2, x3, x4) = U4_ga(x2, x4)
app_in_gga(x1, x2, x3) = app_in_gga(x1, x2)
app_out_gga(x1, x2, x3) = app_out_gga(x1, x2, x3)
U8_gga(x1, x2, x3, x4, x5) = U8_gga(x2, x3, x5)
U1_GA(x1, x2, x3, x4) = U1_GA(x2, x4)
U2_GA(x1, x2, x3, x4, x5) = U2_GA(x2, x4, x5)
QS_IN_GA(x1, x2) = QS_IN_GA(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → QS_IN_GA(Littles)
U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → U2_GA(Xs, Bigs, qs_in_ga(Littles))
U2_GA(Xs, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs)
QS_IN_GA(.(Xs)) → U1_GA(Xs, part_in_agaa(Xs))

The TRS R consists of the following rules:

part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
part_in_agaa(.(Xs)) → U7_agaa(Xs, part_in_agaa(Xs))
part_in_agaa([]) → part_out_agaa([], [], [])
qs_in_ga([]) → qs_out_ga([], [])
qs_in_ga(.(Xs)) → U1_ga(Xs, part_in_agaa(Xs))
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(Xs, part_in_ggaa(X, Xs))
U7_agaa(Xs, part_out_agaa(Xs, Ls, Bs)) → part_out_agaa(.(Xs), Ls, .(Bs))
U1_ga(Xs, part_out_agaa(Xs, Littles, Bigs)) → U2_ga(Xs, Bigs, qs_in_ga(Littles))
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U6_agaa(Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(.(Xs), .(Ls), Bs)
U2_ga(Xs, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(Xs, Ls, qs_in_ga(Bigs))
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
part_in_ggaa(X, .(Xs)) → U7_ggaa(X, Xs, part_in_ggaa(X, Xs))
part_in_ggaa(X, []) → part_out_ggaa(X, [], [], [])
U3_ga(Xs, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(Xs, app_in_gga(Ls, .(Bs)))
U5_ggaa(X, Xs, less_out_ga(X, Y)) → U6_ggaa(X, Xs, part_in_ggaa(X, Xs))
U7_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), Ls, .(Bs))
U4_ga(Xs, app_out_gga(Ls, .(Bs), Ys)) → qs_out_ga(.(Xs), Ys)
less_in_ga(0) → less_out_ga(0, s)
less_in_ga(s) → U9_ga(less_in_aa)
U6_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), .(Ls), Bs)
app_in_gga([], X) → app_out_gga([], X, X)
app_in_gga(.(Xs), Ys) → U8_gga(Xs, Ys, app_in_gga(Xs, Ys))
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U8_gga(Xs, Ys, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(Xs), Ys, .(Zs))

The set Q consists of the following terms:

part_in_agaa(x0)
qs_in_ga(x0)
U5_agaa(x0, x1)
U7_agaa(x0, x1)
U1_ga(x0, x1)
less_in_aa
U6_agaa(x0, x1)
U2_ga(x0, x1, x2)
U9_aa(x0)
part_in_ggaa(x0, x1)
U3_ga(x0, x1, x2)
U5_ggaa(x0, x1, x2)
U7_ggaa(x0, x1, x2)
U4_ga(x0, x1)
less_in_ga(x0)
U6_ggaa(x0, x1, x2)
app_in_gga(x0, x1)
U9_ga(x0)
U8_gga(x0, x1, x2)

We have to consider all (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

QS_IN_GA(.(Xs)) → U1_GA(Xs, part_in_agaa(Xs))

The remaining pairs can at least be oriented weakly.

U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → QS_IN_GA(Littles)
U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → U2_GA(Xs, Bigs, qs_in_ga(Littles))
U2_GA(Xs, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs)

Used ordering: Polynomial interpretation [25]:

POL(.(x₁)) = 1 + x₁
POL(0) = 1
POL(QS_IN_GA(x₁)) = x₁
POL(U1_GA(x₁, x₂)) = x₂
POL(U1_ga(x₁, x₂)) = 0
POL(U2_GA(x₁, x₂, x₃)) = x₂
POL(U2_ga(x₁, x₂, x₃)) = 0
POL(U3_ga(x₁, x₂, x₃)) = 0
POL(U4_ga(x₁, x₂)) = 0
POL(U5_agaa(x₁, x₂)) = 1 + x₁
POL(U5_ggaa(x₁, x₂, x₃)) = 1 + x₂
POL(U6_agaa(x₁, x₂)) = 1 + x₂
POL(U6_ggaa(x₁, x₂, x₃)) = 1 + x₃
POL(U7_agaa(x₁, x₂)) = 1 + x₂
POL(U7_ggaa(x₁, x₂, x₃)) = 1 + x₃
POL(U8_gga(x₁, x₂, x₃)) = 0
POL(U9_aa(x₁)) = 0
POL(U9_ga(x₁)) = x₁
POL([]) = 0
POL(app_in_gga(x₁, x₂)) = 0
POL(app_out_gga(x₁, x₂, x₃)) = 0
POL(less_in_aa) = 1
POL(less_in_ga(x₁)) = 1
POL(less_out_aa(x₁, x₂)) = x₁
POL(less_out_ga(x₁, x₂)) = 0
POL(part_in_agaa(x₁)) = x₁
POL(part_in_ggaa(x₁, x₂)) = x₂
POL(part_out_agaa(x₁, x₂, x₃)) = x₂ + x₃
POL(part_out_ggaa(x₁, x₂, x₃, x₄)) = x₃ + x₄
POL(qs_in_ga(x₁)) = 0
POL(qs_out_ga(x₁, x₂)) = 0
POL(s) = 0

The following usable rules [17] were oriented:

part_in_agaa(.(Xs)) → U7_agaa(Xs, part_in_agaa(Xs))
U7_agaa(Xs, part_out_agaa(Xs, Ls, Bs)) → part_out_agaa(.(Xs), Ls, .(Bs))
U6_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), .(Ls), Bs)
part_in_ggaa(X, .(Xs)) → U7_ggaa(X, Xs, part_in_ggaa(X, Xs))
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
part_in_agaa([]) → part_out_agaa([], [], [])
part_in_ggaa(X, []) → part_out_ggaa(X, [], [], [])
U6_agaa(Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(.(Xs), .(Ls), Bs)
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(Xs, part_in_ggaa(X, Xs))
part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
U5_ggaa(X, Xs, less_out_ga(X, Y)) → U6_ggaa(X, Xs, part_in_ggaa(X, Xs))
U7_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), Ls, .(Bs))

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

              ↳ PiDP

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → QS_IN_GA(Littles)
U1_GA(Xs, part_out_agaa(Xs, Littles, Bigs)) → U2_GA(Xs, Bigs, qs_in_ga(Littles))
U2_GA(Xs, Bigs, qs_out_ga(Littles, Ls)) → QS_IN_GA(Bigs)

The TRS R consists of the following rules:

part_in_agaa(.(Xs)) → U5_agaa(Xs, less_in_aa)
part_in_agaa(.(Xs)) → U7_agaa(Xs, part_in_agaa(Xs))
part_in_agaa([]) → part_out_agaa([], [], [])
qs_in_ga([]) → qs_out_ga([], [])
qs_in_ga(.(Xs)) → U1_ga(Xs, part_in_agaa(Xs))
U5_agaa(Xs, less_out_aa(X, Y)) → U6_agaa(Xs, part_in_ggaa(X, Xs))
U7_agaa(Xs, part_out_agaa(Xs, Ls, Bs)) → part_out_agaa(.(Xs), Ls, .(Bs))
U1_ga(Xs, part_out_agaa(Xs, Littles, Bigs)) → U2_ga(Xs, Bigs, qs_in_ga(Littles))
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U6_agaa(Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(.(Xs), .(Ls), Bs)
U2_ga(Xs, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(Xs, Ls, qs_in_ga(Bigs))
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)
part_in_ggaa(X, .(Xs)) → U5_ggaa(X, Xs, less_in_ga(X))
part_in_ggaa(X, .(Xs)) → U7_ggaa(X, Xs, part_in_ggaa(X, Xs))
part_in_ggaa(X, []) → part_out_ggaa(X, [], [], [])
U3_ga(Xs, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(Xs, app_in_gga(Ls, .(Bs)))
U5_ggaa(X, Xs, less_out_ga(X, Y)) → U6_ggaa(X, Xs, part_in_ggaa(X, Xs))
U7_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), Ls, .(Bs))
U4_ga(Xs, app_out_gga(Ls, .(Bs), Ys)) → qs_out_ga(.(Xs), Ys)
less_in_ga(0) → less_out_ga(0, s)
less_in_ga(s) → U9_ga(less_in_aa)
U6_ggaa(X, Xs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Xs), .(Ls), Bs)
app_in_gga([], X) → app_out_gga([], X, X)
app_in_gga(.(Xs), Ys) → U8_gga(Xs, Ys, app_in_gga(Xs, Ys))
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U8_gga(Xs, Ys, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(Xs), Ys, .(Zs))

The set Q consists of the following terms:

part_in_agaa(x0)
qs_in_ga(x0)
U5_agaa(x0, x1)
U7_agaa(x0, x1)
U1_ga(x0, x1)
less_in_aa
U6_agaa(x0, x1)
U2_ga(x0, x1, x2)
U9_aa(x0)
part_in_ggaa(x0, x1)
U3_ga(x0, x1, x2)
U5_ggaa(x0, x1, x2)
U7_ggaa(x0, x1, x2)
U4_ga(x0, x1)
less_in_ga(x0)
U6_ggaa(x0, x1, x2)
app_in_gga(x0, x1)
U9_ga(x0)
U8_gga(x0, x1, x2)

We have to consider all (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 3 less nodes.

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_GAAA(X, Xs, Ls, Bs)
PART_IN_GAAA(X, .(Y, Xs), .(Y, Ls), Bs) → U5_GAAA(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_GAAA(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → PART_IN_GAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))

The argument filtering Pi contains the following mapping:
less_in_aa(x1, x2) = less_in_aa
less_out_aa(x1, x2) = less_out_aa(x1, x2)
s(x1) = s
U9_aa(x1, x2, x3) = U9_aa(x3)
less_in_ga(x1, x2) = less_in_ga(x1)
0 = 0
less_out_ga(x1, x2) = less_out_ga(x1, x2)
U9_ga(x1, x2, x3) = U9_ga(x3)
.(x1, x2) = .(x2)
U5_GAAA(x1, x2, x3, x4, x5, x6) = U5_GAAA(x1, x6)
PART_IN_GAAA(x1, x2, x3, x4) = PART_IN_GAAA(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem [30] into ordinary QDP problem [15] by application of Pi.

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(X, Y)) → PART_IN_GAAA(X)
PART_IN_GAAA(X) → U5_GAAA(X, less_in_ga(X))

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(0, s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By narrowing [15] the rule PART_IN_GAAA(X) → U5_GAAA(X, less_in_ga(X)) at position [1] we obtained the following new rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(X, Y)) → PART_IN_GAAA(X)

The TRS R consists of the following rules:

less_in_ga(0) → less_out_ga(0, s)
less_in_ga(s) → U9_ga(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(X, less_out_ga(X, Y)) → PART_IN_GAAA(X)

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

less_in_ga(x0)
U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

less_in_ga(x0)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Instantiation

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))
U5_GAAA(X, less_out_ga(X, Y)) → PART_IN_GAAA(X)

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

U9_ga(x0)
less_in_aa
U9_aa(x0)

We have to consider all (P,Q,R)-chains.
By instantiating [15] the rule U5_GAAA(X, less_out_ga(X, Y)) → PART_IN_GAAA(X) we obtained the following new rules:

U5_GAAA(s, less_out_ga(s, x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(0, s)) → PART_IN_GAAA(0)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ UsableRulesProof

                              ↳ QDP

                                ↳ QReductionProof

                                  ↳ QDP

                                    ↳ Instantiation

                                      ↳ QDP

                                        ↳ NonTerminationProof

              ↳ PiDP

Q DP problem:
The TRS P consists of the following rules:

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(s, less_out_ga(s, x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(0, s)) → PART_IN_GAAA(0)

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

The set Q consists of the following terms:

U9_ga(x0)
less_in_aa
U9_aa(x0)

PART_IN_GAAA(s) → U5_GAAA(s, U9_ga(less_in_aa))
PART_IN_GAAA(0) → U5_GAAA(0, less_out_ga(0, s))
PART_IN_GAAA(X) → PART_IN_GAAA(X)
U5_GAAA(s, less_out_ga(s, x1)) → PART_IN_GAAA(s)
U5_GAAA(0, less_out_ga(0, s)) → PART_IN_GAAA(0)

The TRS R consists of the following rules:

less_in_aa → less_out_aa(0, s)
less_in_aa → U9_aa(less_in_aa)
U9_ga(less_out_aa(X, Y)) → less_out_ga(s, s)
U9_aa(less_out_aa(X, Y)) → less_out_aa(s, s)

s = PART_IN_GAAA(X) evaluates to t =PART_IN_GAAA(X)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from PART_IN_GAAA(X) to PART_IN_GAAA(X).

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)

The TRS R consists of the following rules:

qs_in_ag([], []) → qs_out_ag([], [])
qs_in_ag(.(X, Xs), Ys) → U1_ag(X, Xs, Ys, part_in_aaaa(X, Xs, Littles, Bigs))
part_in_aaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_aaaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
less_in_aa(0, s(X)) → less_out_aa(0, s(X))
less_in_aa(s(X), s(Y)) → U9_aa(X, Y, less_in_aa(X, Y))
U9_aa(X, Y, less_out_aa(X, Y)) → less_out_aa(s(X), s(Y))
U5_aaaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_aaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_gaaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
less_in_ga(0, s(X)) → less_out_ga(0, s(X))
less_in_ga(s(X), s(Y)) → U9_ga(X, Y, less_in_aa(X, Y))
U9_ga(X, Y, less_out_aa(X, Y)) → less_out_ga(s(X), s(Y))
U5_gaaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_gaaa(X, Y, Xs, Ls, Bs, part_in_gaaa(X, Xs, Ls, Bs))
part_in_gaaa(X, [], [], []) → part_out_gaaa(X, [], [], [])
U7_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_gaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_gaaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_aaaa(X, Y, Xs, Ls, Bs, part_out_gaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_aaaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_aaaa(X, Y, Xs, Ls, Bs, part_in_aaaa(X, Xs, Ls, Bs))
part_in_aaaa(X, [], [], []) → part_out_aaaa(X, [], [], [])
U7_aaaa(X, Y, Xs, Ls, Bs, part_out_aaaa(X, Xs, Ls, Bs)) → part_out_aaaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ag(X, Xs, Ys, part_out_aaaa(X, Xs, Littles, Bigs)) → U2_ag(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
qs_in_ga([], []) → qs_out_ga([], [])
qs_in_ga(.(X, Xs), Ys) → U1_ga(X, Xs, Ys, part_in_agaa(X, Xs, Littles, Bigs))
part_in_agaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_agaa(X, Y, Xs, Ls, Bs, less_in_aa(X, Y))
U5_agaa(X, Y, Xs, Ls, Bs, less_out_aa(X, Y)) → U6_agaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), .(Y, Ls), Bs) → U5_ggaa(X, Y, Xs, Ls, Bs, less_in_ga(X, Y))
U5_ggaa(X, Y, Xs, Ls, Bs, less_out_ga(X, Y)) → U6_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_ggaa(X, Y, Xs, Ls, Bs, part_in_ggaa(X, Xs, Ls, Bs))
part_in_ggaa(X, [], [], []) → part_out_ggaa(X, [], [], [])
U7_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), Ls, .(Y, Bs))
U6_ggaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_ggaa(X, .(Y, Xs), .(Y, Ls), Bs)
U6_agaa(X, Y, Xs, Ls, Bs, part_out_ggaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), .(Y, Ls), Bs)
part_in_agaa(X, .(Y, Xs), Ls, .(Y, Bs)) → U7_agaa(X, Y, Xs, Ls, Bs, part_in_agaa(X, Xs, Ls, Bs))
part_in_agaa(X, [], [], []) → part_out_agaa(X, [], [], [])
U7_agaa(X, Y, Xs, Ls, Bs, part_out_agaa(X, Xs, Ls, Bs)) → part_out_agaa(X, .(Y, Xs), Ls, .(Y, Bs))
U1_ga(X, Xs, Ys, part_out_agaa(X, Xs, Littles, Bigs)) → U2_ga(X, Xs, Ys, Bigs, qs_in_ga(Littles, Ls))
U2_ga(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ga(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ga(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ga(X, Xs, Ys, app_in_gga(Ls, .(X, Bs), Ys))
app_in_gga([], X, X) → app_out_gga([], X, X)
app_in_gga(.(X, Xs), Ys, .(X, Zs)) → U8_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
U8_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) → app_out_gga(.(X, Xs), Ys, .(X, Zs))
U4_ga(X, Xs, Ys, app_out_gga(Ls, .(X, Bs), Ys)) → qs_out_ga(.(X, Xs), Ys)
U2_ag(X, Xs, Ys, Bigs, qs_out_ga(Littles, Ls)) → U3_ag(X, Xs, Ys, Ls, qs_in_ga(Bigs, Bs))
U3_ag(X, Xs, Ys, Ls, qs_out_ga(Bigs, Bs)) → U4_ag(X, Xs, Ys, app_in_ggg(Ls, .(X, Bs), Ys))
app_in_ggg([], X, X) → app_out_ggg([], X, X)
app_in_ggg(.(X, Xs), Ys, .(X, Zs)) → U8_ggg(X, Xs, Ys, Zs, app_in_ggg(Xs, Ys, Zs))
U8_ggg(X, Xs, Ys, Zs, app_out_ggg(Xs, Ys, Zs)) → app_out_ggg(.(X, Xs), Ys, .(X, Zs))
U4_ag(X, Xs, Ys, app_out_ggg(Ls, .(X, Bs), Ys)) → qs_out_ag(.(X, Xs), Ys)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

Pi DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA(X, .(Y, Xs), Ls, .(Y, Bs)) → PART_IN_AAAA(X, Xs, Ls, Bs)

↳ Prolog

  ↳ PrologToPiTRSProof

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ NonTerminationProof

Q DP problem:
The TRS P consists of the following rules:

PART_IN_AAAA → PART_IN_AAAA

The TRS R consists of the following rules:none

s = PART_IN_AAAA evaluates to t =PART_IN_AAAA

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from PART_IN_AAAA to PART_IN_AAAA.